Second-order cone programming with probabilistic regularization for robust adaptive beamforming
نویسندگان
چکیده
منابع مشابه
Second-Order Cone Programming Formulations for Robust Multiclass Classification
Multiclass classification is an important and ongoing research subject in machine learning. Current support vector methods for multiclass classification implicitly assume that the parameters in the optimization problems are known exactly. However, in practice, the parameters have perturbations since they are estimated from the training data, which are usually subject to measurement noise. In th...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملA Second-order Cone Programming Approach for Robust Downlink Beamforming with Power Control in Cognitive Radio Networks
The downlink beamforiming technology plays a key role in a cognitive radio network (CR-Net). It can be used to reduce transmission power and interference to other users, etc. This paper presents a robust downlink beamforming method with power control for a multiuser multiple-input-single-output (MISO) CR-Net. In this proposed approach, the beamforming optimization problem is formulated as the s...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملSecond-order cone programming approach for elliptically distributed joint probabilistic constraints with dependent rows
In this paper, we investigate the problem of linear joint probabilistic constraints. We assume that the rows of the constraint matrix are dependent and the dependence is driven by a convenient Archimedean copula. Further we assume the distribution of the constraint rows to be elliptically distributed, covering normal, t, or Laplace distributions. Under these and some additional conditions, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Acoustical Society of America
سال: 2017
ISSN: 0001-4966
DOI: 10.1121/1.4976846